Automated Paraconsistent Reasoning via Model Checking

نویسندگان

  • Steve Easterbrook
  • Marsha Chechik
چکیده

Inconsistency is a pervasive problem in software engineering, where different aspects of a system are described in separate models. Resolving all the inconsistencies in a large set of models is often infeasible, in which case automated reasoning tools based on classical logic have limited application. In this paper we describe an automated tool for paraconsistent reasoning, using multi-valued logics. The reasoning engine is an adaptation of classical model checking, and works for any multi-valued logic whose truth values form a quasi-boolean lattice. We describe the design of the model checker, and show how it can be used to reason about models created by merging information from multiple conflicting sources.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paraconsistent Computation Tree Logic Paraconsistent Computation Tree Logic * 1

It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than other types of logical systems. In this paper, a paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree logic CTL. PCTL can be used to appropriately formalize inconsistency-tolerant temporal reasoning....

متن کامل

Paraconsistent Computation Tree Logic ∗ 1

It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than other types of logical systems. In this paper, a paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree logic CTL. PCTL can be used to appropriately formalize inconsistency-tolerant temporal reasoning....

متن کامل

Extended Full Computation-tree Logics for Paraconsistent Model Checking

It is known that the full computation-tree logic CTL∗ is an important base logic for model checking. The bisimulation theorem for CTL∗ is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL∗ and 4LCTL∗ of CTL∗ are shown, and a translation from 4CTL∗ into CTL∗ is presented. By using 4CTL∗ and 4LCTL∗, in...

متن کامل

Handling Inconsistency in Knowledge Bases

Real-world automated reasoning systems, based on classical logic, face logically inconsistent information, and they must cope with it. It is onerous to develop such systems because classical logic is explosive. Recently, progress has been made towards semantics that deal with logical inconsistency. However, such semantics was never analyzed in the aspect of inconsistency tolerant relational mod...

متن کامل

Reasoning with inconsistencies in hybrid MKNF knowledge bases

This paper is concerned with the handling of inconsistencies occurring in the combination of description logics and rules, especially in hybrid MKNF knowledge bases. More precisely, we present a paraconsistent semantics for hybrid MKNF knowledge bases (called para-MKNF knowledge bases) based on four-valued logic as proposed by Belnap. We also reduce this paraconsistent semantics to the stable m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001